Cluster Splitting Based High Dimensional Metric Space Index B<SUP>+</SUP>-Tree
نویسندگان
چکیده
منابع مشابه
BM+-Tree: A Hyperplane-Based Index Method for High-Dimensional Metric Spaces
In this paper, we propose a novel high-dimensional index method, the BM-tree, to support efficient processing of similarity search queries in high-dimensional spaces. The main idea of the proposed index is to improve data partitioning efficiency in a high-dimensional space by using a rotary binary hyperplane, which further partitions a subspace and can also take advantage of the twin node conce...
متن کاملDAHC-tree: An Effective Index for Approximate Search in High-Dimensional Metric Spaces
Similarity search in high-dimensional metric spaces is a key operation in many applications, such as multimedia databases, image retrieval, object recognition, and others. The high dimensionality of the data requires special index structures to facilitate the search. A problem regarding the creation of suitable index structures for highdimensional data is the relationship between the geometry o...
متن کاملA Parallel Similarity Search in High Dimensional Metric Space Using M-Tree
In this study, parallel implementation of M-tree to index high dimensional metric space has been elaborated and an optimal declustering technique has been proposed. First, we have defined the optimal declustering and developed an algorithm based on this definition. Proposed declustering algorithm considers both object proximity and data load on disk/processors by executing a k-NN or a range que...
متن کاملBRep-Index: A Multi-Dimensional Space Partitioning Tree
In this paper we introduce the brep-index, a new multi-dimensional space partitioning data structure that provides quick access to the vertices, edges and faces of a boundary representation (brep), thus yielding a single unified representation for polyhedral solids. We d~cribe the cortStruction of the brep-index and show that its size is O(v +e + f), where VI €I and J are the number of vertices...
متن کاملAn Effective Clustering Algorithm to Index High Dimensional Metric Spaces
A metric space consists of a collection of objects and a distance function deened among them, which satis-es the triangular inequality. The goal is to prepro-cess the set so that, given a set of objects and a query, retrieve those objects close enough to the query. The number of distances computed to achieve this goal is the complexity measure. The problem is very diicult in the so-called high-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2008
ISSN: 1000-9825
DOI: 10.3724/sp.j.1001.2008.01401